Irreducible Numerical Semigroups Having Toms Decomposition
نویسندگان
چکیده
In this paper we prove that if S is an irreducible numerical semigroup and S is generated by an interval or S has multiplicity 3 or 4, then it enjoys Toms decomposition. We also prove that if a numerical semigroup can be expressed as an expansion of a numerical semigroup generated by an interval, then it is irreducible and has Toms decomposition.
منابع مشابه
Subdirectly irreducible acts over some semigroups
In this paper, we characterize and find the number of subdirectly irreducible acts over some classes of semigroups, such as zero semigroups, right zero semigroups and strong chain of left zero semigroups.
متن کاملAlmost Symmetric Numerical Semigroups Generated by Four Elements
In this paper, we study almost symmetric numerical semigroups generated by 4-elements. Rosales and Garćıa-Sánchez [RG2] proved that every almost symmetric numerical semigroup can be constructed by removing some minimal generators from an irreducible numerical semigroup with the same Frobenius number. Using this result, we concretely construct almost symmetric numerical semigroups generated by 4...
متن کاملA Numerical Local Dimension Test for Points on the Solution Set of a System of Polynomial Equations
The solution set V of a polynomial system, i.e., the set of common zeroes of a set of multivariate polynomials with complex coefficients, may contain several components, e.g., points, curves, surfaces, etc. Each component has attached to it a number of quantities, one of which is its dimension. Given a numerical approximation to a point p on the set V , this article presents an efficient algori...
متن کاملIrreducible Numerical Semigroups
We give a characterization for irreducible numerical semi-groups. From this characterization we obtain that every irre-ducible numerical semigroup is either a symmetric or pseudo-symmetric numerical semigroup. We study the minimal presentations of an irreducible numerical semigroup. Separately, we deal with the cases of maximal embedding dimension and multiplicity 3 and 4.
متن کاملNumerical Local Irreducible Decomposition
Globally, the solution set of a system of polynomial equations with complex coefficients can be decomposed into irreducible components. Using numerical algebraic geometry, each irreducible component is represented using a witness set thereby yielding a numerical irreducible decomposition of the solution set. Locally, the irreducible decomposition can be refined to produce a local irreducible de...
متن کامل